Dedekind-MacNeille Completion and Multi-adjoint Lattices
نویسندگان
چکیده
Among other applications, multi-adjoint lattices have been successfully used for modeling flexible notions of truth-degrees in the fuzzy extension of logic programming called MALP (Multi-Adjoint Logic Programming). In this paper we focus in the completion of such mathematical construct by adapting the classical notion of Dedekind-MacNeille in order to relax this usual hypothesis on such kind of ordered sets. On the practical side, we show too the role played by multi-adjoint lattices into the “Fuzzy LOgic Programming Environment for Research” FLOPER that we have developed in our research group.
منابع مشابه
Dedekind-MacNeille Completion of n-Lattices
A completion of an n-lattice L = 〈L,.1, . . . , .n〉 is defined, by analogy with lattices, as a pair 〈e,C〉, where C is a complete n-lattice and e : L → C is an n-lattice embedding. The Basic Theorem of Polyadic Concept Analysis is exploited to construct a completion of an arbitrary n-lattice. The completion reduces to the Dedekind-MacNeille completion in the dyadic case, which was first formulat...
متن کاملDedekind-MacNeille Completion of n -ordered Sets
A completion of an n-ordered set P = 〈P, 1, . . . , n〉 is defined, by analogy with the case of posets (2-ordered sets), as a pair 〈e,Q〉, where Q is a complete n-lattice and e : P → Q is an n-order embedding. The Basic Theorem of Polyadic Concept Analysis is exploited to construct a completion of an arbitrary nordered set. The completion reduces to the Dedekind–MacNeille completion in the dyadic...
متن کاملFinite Orders and Their Minimal Strict Completion Lattices
Whereas the Dedekind-MacNeille completion D(P ) of a poset P is the minimal lattice L such that every element of L is a join of elements of P, the minimal strict completion D(P )∗ is the minimal lattice L such that the poset of join-irreducible elements of L is isomorphic to P. (These two completions are the same if every element of P is joinirreducible). In this paper we study lattices which a...
متن کاملThe Macneille Completion of a Uniquely Complemented Lattice
Problem 36 of the third edition of Birkhoo's Lattice theory 2] asks whether the MacNeille completion of uniquely complemented lattice is necessarily uniquely complemented. We show that the MacNeille completion of a uniquely complemented lattice need not be complemented. Questions regarding the axiomatics of Boolean algebras led Huntington to conjecture , in 1904, that every uniquely complemente...
متن کاملThe completion of a poset in a lattice of antichains
It is well known that given a poset, X, the lattice of order ideals of X, 〈I(X),⊆〉, is a completion of X via the order-embedding φ : X ↪→ I(X) where φ(x) = ↓x. Herein we define a lattice of antichains in X, 〈A(X),4〉, and prove it is isomorphic to 〈I(X),⊆〉. We establish the “join” and “meet” operations of the lattice, and present results for 〈A(X),4〉 analogous to standard results for 〈I(X),⊆〉, i...
متن کامل